AN ALGORITHM FOR INTELLIGENT BACKTRACKINGSATO T.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 147; PP. 88-98; BIBL. 5 REF.Conference Paper

EXPONENTIAL IMPROVEMENT OF EFFICIENT BACKTRACKING: A STRATEGY FOR PLAN-BASED DEDUCTIONPIETRZYKOWSKI T; MATWIN S.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 223-239; BIBL. 15 REF.Conference Paper

TWO BACKTRACK ALGORITHMS FOR THE RADIO FREQUENCY INTERMODULATION PROBLEMMORITO S; SALKIN HM; WILLIAMS DE et al.1980; APPL. MATH. OPTIMIZ.; DEU; DA. 1980; VOL. 6; NO 3; PP. 221-240; BIBL. 19 REF.Article

GENERATING COSET REPRESENTATIVES FOR PERMUTATION GROUPSALLISON L.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 3; PP. 227-244; BIBL. 15 REF.Article

FORMAL CORRECTNESS PROOFS OF A NONDETERMINISTIC PROGRAMUPFAL E.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 2; PP. 86-92; BIBL. 7 REF.Article

ELIMINATING RECURSION FROM COMBINATORIC PROCEDURESROHL JS.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 8; PP. 803-817; BIBL. 7 REF.Article

AN AVERAGE TIME ANALYSIS OF BACKTRACKINGBROWN CA; PURDOM PW JR.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 583-593; BIBL. 11 REF.Article

THE UTILITY OF PRECISION IN SEARCH HEURISTICSPEARL J.1982; ECAI 82. EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE/1982-07-12/ORSAY; DEU; KAISERLAUTERN: IMPR. ABTEILUNG FOTO-REPRO-DRUCK DER UNIVERSITAET KAISERLAUTERN; DA. 1982; PP. 177-179; BIBL. 10 REF.Conference Paper

AN ALGORITHM FOR EXHAUSTIVE GENERATION OF BUILDING FLOOR PLANSGALLE P.1981; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1981; VOL. 24; NO 12; PP. 813-825; BIBL. 46 REF.Article

BACKTRACKING WITH MULTI-LEVEL DYNAMIC SEARCH REARRANGEMENTPURDOM PW JR; BROWN CA; ROBERTSON EL et al.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 2; PP. 99-113; BIBL. 13 REF.Article

A TECHNIQUE FOR IMPLEMENTING BACKTRACK ALGORITHMS AND ITS APPLICATIONHITOTUMATU H; NOSHITA K.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 174-175; BIBL. 5 REF.Article

SYNTHESIZING CONSTRAINST EXPRESSIONSFREUDER EC.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 11; PP. 958-966; BIBL. 24 REF.Article

DEDUCTION PLANS: A BASIS FOR INTELLIGENT BACKTRACKINGCOX PT; PIETRZYKOWSKI T.1981; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1981; VOL. 3; NO 1; PP. 52-65; BIBL. 24 REF.Article

STATE RESTORATION IN SYSTEMS OF COMMUNICATING PROCESSESRUSSELL DL.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 2; PP. 183-194; BIBL. 15 REF.Article

Improvement of the backpropagation algorithm for training neural networksLEONARD, J; KRAMER, M. A.Computers & chemical engineering. 1990, Vol 14, Num 3, pp 337-341, issn 0098-1354Article

Improved cryptanalysis of the self-shrinking generatorZENNER, Erik; KRAUSE, Matthias; LUCKS, Stefan et al.Lecture notes in computer science. 2001, pp 21-35, issn 0302-9743, isbn 3-540-42300-1Conference Paper

On the dynamic detection of interchangeability in finite constraint satisfaction problemsBECKWITH, Amy M; CHOUEIRY, Berthe Y.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 760Conference Paper

Gestion explicite du retour-arrière dans un système d'apprentissage par l'action: le système CHOSE.2 = Effective backtracking in a learning by action system: the system CHOSE.2Radiguet, Serge; Lux, Augustin.1993, 195 p.Thesis

The tractability of global constraintsBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2004, pp 716-720, issn 0302-9743, isbn 3-540-23241-9, 5 p.Conference Paper

Lemma and model caching in decision procedures for quantified Boolean formulasLETZ, Reinhold.Lecture notes in computer science. 2002, pp 160-175, issn 0302-9743, isbn 3-540-43929-3, 16 p.Conference Paper

The impact of branching heuristics in propositional satisfiability algorithmsMARQUES-SILVA, J.Lecture notes in computer science. 1999, pp 62-74, issn 0302-9743, isbn 3-540-66548-XConference Paper

The set union problem with unlimited backtrackingAPOSTOLICO, A; ITALIANO, G. F; GAMBOSI, G et al.SIAM journal on computing (Print). 1994, Vol 23, Num 1, pp 50-70, issn 0097-5397Article

Agent search in uniform b-ary trees : Multiple goals and unequal costsDASGUPTA, P; CHAKRABARTI, P. P; DESARKAR, S. C et al.Information processing letters. 1996, Vol 58, Num 6, pp 311-318, issn 0020-0190Article

Motion planning for many degrees of freedom : sequential search with backtrackingKAMAL KANT GUPTA; ZHENPING GUO.IEEE transactions on robotics and automation. 1995, Vol 11, Num 6, pp 897-906, issn 1042-296XArticle

THE CONSISTENT LABELING PROBLEM. IHARALICK RM; SHAPIRO LG.1979; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1979; VOL. 1; NO 2; PP. 173-184; BIBL. 29 REF.Article